Fast methods to compute the Riemann zeta function

Fast methods to compute the Riemann zeta function

The Riemann zeta function on the critical line can be computed using a straightforward application of the Riemann-Siegel formula, Schönhage’s method, or Heath-Brown’s method. The complexities of these methods have exponents 1/2, 3/8 (=0.375), and 1/3 respectively. In this paper, three new fast and potentially practical methods to compute zeta are presented. One method is very simple. Its comple...

An amortized-complexity method to compute the Riemann zeta function

A practical method to compute the Riemann zeta function is presented. The method can compute ζ(1/2 + it) at any T 1/4 points in [T, T + T 1/4] using an average time of T 1/4+o(1) per point. This is the same complexity as the Odlyzko-Schönhage algorithm over that interval. Although the method far from competes with the Odlyzko-Schönhage algorithm over intervals much longer than T 1/4, it still h...

q-Riemann zeta function

We consider the modified q-analogue of Riemann zeta function which is defined by ζq(s)= ∑∞ n=1(qn(s−1)/[n]s), 0< q < 1, s ∈ C. In this paper, we give q-Bernoulli numbers which can be viewed as interpolation of the above q-analogue of Riemann zeta function at negative integers in the same way that Riemann zeta function interpolates Bernoulli numbers at negative integers. Also, we will treat some...

Summability Methods Based on the Riemann Zeta Function

This paper is a study of summability methods that are based on the Riemann Zeta function. A limitation theorem is proved which gives a necessary condition for a sequence x to be zeta summable. A zeta summability matrix Z associated with a real sequence is introduced; a necessary and sufficient condition on the sequence such that Z maps 11 to 11 is established. Results comparing the strength of ...

Mollifying the Riemann Zeta-function